Parsing Mathematics Typeset in T E X

نویسنده

  • Eylon Caspi
چکیده

The recognition of mathematics notation by a computer is made di cult by the two dimensional nature of the parsing problem as well as by the richness and ambiguity of the notation Parsing mathematics typeset in TEX constitutes a simpli ed idealized D recognition problem allowing the recognition engine to concentrate more on semantic understanding Choosing TEX as an input form for mathematics is immediately desirable for document recognition because of the availability of many published works in TEX form It is also desirable as a linearized intermediate form emitted by a mathematically oriented graphical user interface as in Tech Explorer A multi pass mathematics recognition engine is described designed with the intent of transcribing formulas from the electronic ref erence A Table of Integrals Series and Products into LISP statements suitable for a computer algebra system The engine is currently capable of transcribing of integral and summation formulas in the domain of real scalar calculus

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a generalization of central Armendariz rings

In this paper, some properties of $alpha$-skew Armendariz and central Armendariz rings have been studied by variety of others. We generalize the notions to central $alpha$-skew Armendariz rings and investigate their properties. Also, we show that if $alpha(e)=e$ for each idempotent $e^{2}=e in R$ and $R$ is $alpha$-skew Armendariz, then $R$ is abelian. Moreover, if $R$ is central $alpha$-skew A...

متن کامل

Parsing Mathematics Typeset in TEX CS - 282 Course Project

The recognition of mathematics notation by a computer is made difficult by the two-dimensional nature of the parsing problem as well as by the richness and ambiguity of the notation. Parsing mathematics typeset in TEX constitutes a simplified, idealized 2D recognition problem, allowing the recognition engine to concentrate more on semantic understanding. Choosing TEX as an input form for mathem...

متن کامل

Diophantine Equations Related with Linear Binary Recurrences

In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...

متن کامل

The exponential functions of central-symmetric $X$-form matrices

It is well known that the matrix exponential function has practical applications in engineering and applied sciences. In this paper, we present some new explicit identities to the exponential functions of a special class of matrices that are known as central-symmetric $X$-form. For instance, $e^{mathbf{A}t}$, $t^{mathbf{A}}$ and $a^{mathbf{A}t}$ will be evaluated by the new formulas in this par...

متن کامل

New best proximity point results in G-metric space

Best approximation results provide an approximate solution to the fixed point equation $Tx=x$, when the non-self mapping $T$ has no fixed point. In particular, a well-known best approximation theorem, due to Fan cite{5}, asserts that if $K$ is a nonempty compact convex subset of a Hausdorff locally convex topological vector space $E$ and $T:Krightarrow E$ is a continuous mapping, then there exi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997